no-homomorphism conditions for hypergraphs
نویسندگان
چکیده مقاله:
In this paper, we define some new homomorphism-monotone parameters for hypergraphs. Using these parameters, we extend some graph homomorphism results to hypergraph case. Also, we present some bounds for some well-known invariants of hypergraphs such as fractional chromatic number,independent numer and some other invariants of hyergraphs, in terms of these parameters.
منابع مشابه
Hypergraphs, Quasi-randomness, and Conditions for Regularity
Haviland and Thomason and Chung and Graham were the first to investigate systematically some properties of quasi-random hypergraphs. In particular, in a series of articles, Chung and Graham considered several quite disparate properties of random-like hypergraphs of density 1/2 and proved that they are in fact equivalent. The central concept in their work turned out to be the so called deviation...
متن کاملDensity Conditions for Panchromatic Colourings of Hypergraphs
Let H=(V,E) be a hypergraph. A panchromatic t-colouring of H is a t-colouring of its vertices such that each edge has at least one vertex of each colour; and H is panchromatically t-choosable if, whenever each vertex is given a list of t colours, the vertices can be coloured from their lists in such a way that each edge receives at least t different colours. The Hall ratio of H is h(H) =min {∣∣...
متن کاملNecessary Spectral Conditions for Coloring Hypergraphs
Hoffman proved that for a simple graph G, the chromatic number χ(G) obeys χ(G) ≥ 1 − λ1 λn where λ1 and λn are the maximal and minimal eigenvalues of the adjacency matrix of G respectively. Lovász later showed that χ(G) ≥ 1− λ1 λn for any (perhaps negatively) weighted adjacency matrix. In this paper, we give a probabilistic proof of Lovász’s theorem, then extend the technique to derive generali...
متن کاملHighly Arc-Transitive Digraphs With No Homomorphism Onto Z
In an in nite digraph D an edge e is reachable from an edge e if there exists an alternating walk in D whose initial and terminal edges are e and e Reachability is an equivalence relation and if D is arc transitive then this relation is either universal or all of its equiv alence classes induce isomorphic bipartite digraphs In Question Cameron Praeger and Wormald asked if there exist highly arc...
متن کاملOptimal Divisibility Conditions for Loose Hamilton Cycles in Random Hypergraphs
In the random k-uniform hypergraph H (k) n,p of order n, each possible k-tuple appears independently with probability p. A loose Hamilton cycle is a cycle of order n in which every pair of consecutive edges intersects in a single vertex. It was shown by Frieze that if p ≥ c(log n)/n2 for some absolute constant c > 0, then a.a.s. H (3) n,p contains a loose Hamilton cycle, provided that n is divi...
متن کاملExact Algorithm for Graph Homomorphism and Locally Injective Graph Homomorphism
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 5 شماره 2
صفحات 45- 53
تاریخ انتشار 2018-10-01
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023